A Publicly Verifiable Secret Sharing Scheme Based on Multilinear Diffie-Hellman Assumption

Using multiple linear of multilinear map, we propose a simple, non-interactive and effective publicly verifiable secret sharing (PVSS) scheme based on multilinear DiffieHellman assumption (MDH). Up to now, the publicly verifiable of secret sharing is still an issue. In this paper, we set the sharing secret is a multiple linear pairing, we apply the multiple linear property of multilinear map for the shares authentication to achieve publicly verifiability of secret sharing. What’s more, the batch verification technique is used to reduce the computational overhead at share verification phase. Compared with the existing programs, this scheme has improved communication efficiency under the same security level and it can meet those high efficiency and security of the communication requirements of the application scenarios. In addition, we apply our PVSS scheme to electronic voting skillfully. At last, the performance analysis results show the publicly verifiability, security and practicality of our scheme in the random oracle and under MDH assumption.